Many search algorithms can be regarded as traversing a graph of possible states. This includes game playing where the states are board positions and the connections moves between them, but also moe general planning such as means end analysis. Some models cogntive models including ACT-R and SOAR use forms of state space search to emulate human planning and problem solving.
Used on Chap. 3: page 46; Chap. 15: page 345; Chap. 22: page 537
Also known as state space traversal
Towers of Hanoi: graph of possible states and moves.